Efficient Scheduling Algorithms for Total Exchange on GRID Environment
نویسندگان
چکیده
In this paper, we propose two efficient scheduling algorithms for the total exchange, which is a basic communication pattern used on the GRID environment. Both algorithms are used with the open shop algorithm. The first algorithm is a static scheduling algorithm which partitions messages before the open shop algorithm, and the second algorithm is a dynamic algorithm used in the execution of the open shop algorithm. Simulation results show that our scheduling algorithms achieve performance improvements in comparison with a previous algorithm.
منابع مشابه
A Scheduling Algorithm with Static Partition for Total Exchange
The GRID environment is a parallel or distributed system which utilizes geographically distributed computational resources, and has been receiving considerable attention over recent years. On the GRID environment, efficient scheduling algorithms for basic communication operations are important to improve total computational performance. In this paper, we consider improvement of scheduling algor...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملAn Efficient Data Replication Strategy in Large-Scale Data Grid Environments Based on Availability and Popularity
The data grid technology, which uses the scale of the Internet to solve storage limitation for the huge amount of data, has become one of the hot research topics. Recently, data replication strategies have been widely employed in distributed environment to copy frequently accessed data in suitable sites. The primary purposes are shortening distance of file transmission and achieving files from ...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملScheduling Algorithms Performance Evaluation in Grid Environments
Effective scheduling is critical for the performance of an application launched onto the Grid environment [13], [14]. Deriving efficient algorithms for this scheduling has always been a challenging research area. Many scheduling algorithms have been proposed, studied and compared but there are few studies comparing their performance in Grid environments. The Grid environment has the unique prop...
متن کامل